Limitations for Nonlinear Observation Over Erasure Channel
نویسندگان
چکیده
منابع مشابه
Control of systems in Lure form over erasure channel
In this paper, we study the problem of control of discrete-time nonlinear systems in Lure form over erasure channels at the input and output. The input and output channel uncertainties are modeled as Bernoulli random variables. The main results of this paper provide sufficient condition for the mean square exponential stability of the closed loop system expressed in terms of statistics of chann...
متن کاملJoint Cache-Channel Coding over Erasure Broadcast Channels
We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network congestion, where some content can be preplaced in local caches near the receivers. We formulate the cacheaided communications problem as a joint cache-chan...
متن کاملScaling Law of Turbo Codes over the Binary Erasure Channel
Since turbo codes with iterative decoding were introduced [1], a huge amount of research activities have been conducted on the evaluation or prediction of the performance of turbo codes. The iterative turbo decoding algorithm can be analyzed by studying two open-loop constituent decoders separately [2]–[6]. Given the statistic of communication channel output, the behavior of each constituent de...
متن کاملDecoding of 2D convolutional codes over an erasure channel
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...
متن کاملInput-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2013
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2012.2208316